CLAS: a Complete Learning Algorithm for propositional Satisfiability
نویسندگان
چکیده
In this paper an approach is described for solving propositional Satisfiability problems, which makes use of an adaptive technique. Its main feature is a new enumeration scheme, which is able to identify, at an early stage, hard sub-formulae. This scheme is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a clause based branching tree. Completeness is guaranteed, being this a Branch
منابع مشابه
A Complete Adaptive Algorithm for Propositional Satisfiability
An approach to propositional satisfiability using an adaptive procedure is described. Its main feature is a new branching rule, which is able to identify, at an early stage, hard sub-formulae. Such branching rule is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a clause based branching tree. Completeness i...
متن کاملComplete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search algorithms are notoriously incomplete: They are not guaranteed to find a feasible solution if one exists and they cannot be used to determine unsatisfiability. We present an algorithmic framework for complete local sear...
متن کاملXOR Satisfiability Solver Module for DPLL Integration
Satisfiability solvers that are based on the Davis-Putnam-Logemann-Loveland (DPLL) algorithm operate on propositional logic formulas in conjunctive normal form (CNF). Despite major improvements in solver technology, using only CNF does not seem to scale well for problem instances involving XOR expressions. We present a decision procedure to determine effectively the satisfiability of XOR clause...
متن کاملPool resolution is NP-hard to recognize
A pool resolution proof is a dag-like resolution proof which admits a depth-first traversal tree in which no variable is used as a resolution variable twice on any branch. The problem of determining whether a given dag-like resolution proof is a valid pool resolution proof is shown to be NP-complete. Propositional resolution has been the foundational method for reasoning in propositional logic,...
متن کاملTheoretical and Practical Aspects of Bit-Vector Reasoning
Satisfiability Modulo Theories (SMT) is a broad field of research and an important topic for many practical applications. In this thesis, we focus on theories of bitvectors as used, e.g., in hardware and software verification, but also in many other areas. In particular, we discuss satisfiability of bit-vector logics and related problems. The satisfiability problem of propositional formulas (SA...
متن کامل